Asymptotic stability for a class of boundary control systems with non-linear damping**This work was supported by French sponsored projects HAMEC-MOPSYS and Labex ACTION under reference codes ANR-11-BS03-0002 and ANR-11-LABX-0001-01 respectively
نویسندگان
چکیده
The asymptotic stability of boundary controlled port-Hamiltonian systems defined on a 1D spatial domain interconnected to a class of non-linear boundary damping is addressed. It is shown that if the port-Hamiltonian system is approximately observable, then any boundary damping which behaves linear for small velocities asymptotically stabilizes the system.
منابع مشابه
Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable
We show that triangle-free graphs that do not contain an induced subgraph isomorphic to a subdivision of K4 are 3-colorable. This proves a conjecture of Trotignon and Vušković [5]. ∗Supported by NSF grant DMS-1550991 and US Army Research Office Grant W911NF16-1-0404. †Partially supported by ANR project Stint under reference ANR-13-BS02-0007 and by the LABEX MILYON (ANR-10-LABX-0070) of Universi...
متن کاملGraphs with no induced five-vertex path or antipath
We prove that a graph G contains no induced 5-vertex path and no induced complement of a 5-vertex path if and only if G is obtained from 5-cycles and split graphs by repeatedly applying the following operations: substitution, split unification, and split unification in the complement, where split unification is a new class-preserving operation introduced here. ∗Princeton University, Princeton, ...
متن کاملMetastability of Queuing Networks with Mobile Servers
We study symmetric queuing networks with moving servers and FIFO service discipline. The mean-field limit dynamics demonstrates unexpected behavior which we attribute to the metastability phenomenon. Large enough finite symmetric networks on regular graphs are proved to be transient for arbitrarily small inflow rates. However, the limiting non-linear Markov process possesses at least two statio...
متن کاملRestricted Frame Graphs and a Conjecture of Scott
Scott proved in 1997 that for any tree T , every graph with bounded clique number which does not contain any subdivision of T as an induced subgraph has bounded chromatic number. Scott also conjectured that the same should hold if T is replaced by any graph H. Pawlik et al. recently constructed a family of trianglefree intersection graphs of segments in the plane with unbounded chromatic number...
متن کاملColoring Non-Crossing Strings
For a family of geometric objects in the plane F = {S1, . . . , Sn}, define χ(F) as the least integer ` such that the elements of F can be colored with ` colors, in such a way that any two intersecting objects have distinct colors. When F is a set of pseudo-disks that may only intersect on their boundaries, and such that any point of the plane is contained in at most k pseudo-disks, it can be p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016